A gallai-type problem
نویسندگان
چکیده
منابع مشابه
Sylvester-Gallai type theorems for approximate collinearity
We study questions in incidence geometry where the precise position of points is ‘blurry’ (e.g. due to noise, inaccuracy or error). Thus lines are replaced by narrow tubes, and more generally affine subspaces are replaced by their small neighborhood. We show that the presence of a sufficiently large number of approximately collinear triples in a set of points in C implies that the points are cl...
متن کاملGallai and anti-Gallai graphs
This chapter deals with two graph classes the Gallai graphs and the anti-Gallai graphs. \Ve construct infinitely many pairs of graphs G and H such that f( G) = r( H). The existence of a finite family offorbidden subgraphs for the Gallai graphs and the ant.i-Gallai graphs to be H-frce, for any fillit.e graph H is proved and the forbidden subgraph characterizations of G for which the Gallai graph...
متن کاملRamsey-type results for Gallai colorings
A Gallai-coloring (G-coloring) is a generalization of 2-colorings of edges of complete graphs: a G-coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Here we extend some results known earlier for 2-colorings to G-colorings. We prove that in every G-coloring of Kn there exists each of the following: 1. a monochromatic double star with at...
متن کاملGallai-type theorems and domination parameters
Let 7(G) denote the minimum cardinality of a dominating set of a graph G = (V,E). A longstanding upper bound for 7(G) is attributed to Berge: For any graph G with n vertices and maximum degree A(G), 7(G) <~ n A(G). We eharacterise connected bipartite graphs which achieve this upper bound. For an arbitrary graph G we furnish two conditions which are necessary if 7(G) + A(G) = n and are sufficien...
متن کاملA Gallai-Edmonds-type structure theorem for path-matchings
As a generalization of matchings, Cunningham and Geelen introduced the notion of path-matchings. We give a structure theorem for path-matchings which generalizes the fundamental Gallai-Edmonds structure theorem for matchings. Our proof is purely combinatorial.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1978
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90052-3